Coloring Complexes and Arrangements
نویسنده
چکیده
Steingrimsson’s coloring complex and Jonsson’s unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear decompositions. These convex ear decompositions impose strong new restrictions on the chromatic polynomials of all finite graphs.
منابع مشابه
Link complexes of subspace arrangements
Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced by H. In particular, this generalizes Steingŕımsson’s coloring complex of a graph. We do the following: (1) When A is a hyperplane arrangement, ∆A,H is shown to be shellable. As a special case, we answer affirmatively a question ...
متن کاملHypergraph coloring complexes
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes-a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring complexes of graphs, break down in this more general setting, e.g., Cohen-Macaulayness and partitiona...
متن کاملUpper and Lower Bounds on Long Dual Paths in Line Arrangements
Given a line arrangement A with n lines, we show that there exists a path of length n/3−O(n) in the dual graph of A formed by its faces. This bound is tight up to lower order terms. For the bicolored version, we describe an example of a line arrangement with 3k blue and 2k red lines with no alternating path longer than 14k. Further, we show that any line arrangement with n lines has a coloring ...
متن کاملThe Topology of the Coloring Complex
In a recent paper, E. Steingŕımsson associated to each simple graph G a simplicial complex ∆G denoted as the coloring complex of G. Certain nonfaces of ∆G correspond in a natural manner to proper colorings of G. Indeed, the h-vector is an affine transformation of the chromatic polynomial χG of G, and the reduced Euler characteristic is, up to sign, equal to |χG(−1)| − 1. We show that ∆G is cons...
متن کاملFrom Polytopes to Enumeration
In the problem session you saw that v-e+f=2 for 3-polytopes. Is something similar true in higher dimensions? Are there other restrictions on the number of faces of each dimension? What is the most number of faces in each dimension if we fix the number of vertices and dimension? The least? What if we fix other numbers of faces in random dimensions? Notice that all of these questions involve coun...
متن کامل